Some Characterizations of Functions Computable in On-Line Arithmetic
نویسنده
چکیده
Absfmct-After a short introduction to on-line computing, we prove that the functions computable in on-line by a finite automaton are piecewise afthe functions whose coefikients are rational numbers (i.e., the fnnctions f(s) = UP + b, or f(z-, y) = nx + by + c where a. b, and c are rational). A consequence of this study is that multiplication, division, and elementary functions of operands of arbitrarily long length cannot be performed using bounded-she operators.
منابع مشابه
Polynomial time computable real functions
In this paper, we study computability and complexity of real functions. We extend these notions, already defined for functions over closed intervals or over the real line to functions over particular real open sets and give some results and characterizations, especially for polynomial time computable functions. Our representation of real numbers as sequences of rational numbers allows us to imp...
متن کاملAlgebraic Characterization of Complexity Classes of Computable Real Functions
Several algebraic machine-independant characterizations of computable functions over the reals have been obtained recently. In particular nice connections between the class of computable functions (and some of its sub and sup-classes) over the reals and algebraically defined (suband sup-) classes of R-recursive functions à la Moore 96 have been obtained. We provide in this paper a framework tha...
متن کاملAxiomatizing proof tree concepts in Bounded Arithmetic
We construct theories of Cook-Nguyen style two-sort bounded arithmetic whose provably total functions are exactly those in LOGCFL and LOGDCFL. Axiomatizations of both theories are based on the proof tree size characterizations of these classes. We also show that our theory for LOGCFL proves a certain formulation of the pumping lemma for context-free languages. 1998 ACM Subject Classification F....
متن کاملA Framework for Algebraic Characterizations in Recursive Analysis
Algebraic characterizations of the computational aspects of functions defined over the real numbers provide very effective tool to understand what computability and complexity over the reals, and generally over continuous spaces, mean. This is relevant for both communities of computer scientists and mathematical analysts, particularly the latter who do not understand (and/or like) the language ...
متن کاملOn characterizations of weakly $e$-irresolute functions
The aim of this paper is to introduce and obtain some characterizations of weakly $e$-irresolute functions by means of $e$-open sets defined by Ekici [6]. Also, we look into further properties relationships between weak $e$-irresoluteness and separation axioms and completely $e$-closed graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Computers
دوره 43 شماره
صفحات -
تاریخ انتشار 1994